On Implication Problems for Disjunctive Statements
نویسندگان
چکیده
Implication problems occur in many areas of computer science. Examples include, of course, logic, but also database systems (constraints), data mining (association rules), and reasoning under uncertainty (conditional independence). We provide a general framework for implication problems based on the observation that many can be reduced to an implication problem for additive constraints on specific classes of real-valued functions. Furthermore, we provide inference systems and properties of classes of real-valued functions which imply the soundness and completeness of these systems. We present computational complexity results for an important class of implication problems for which a finite axiomatization exists. We also derive properties of classes of real-valued functions that imply the non-existence of finite, complete axiomatizations.
منابع مشابه
A Unifying Framework for Disjunctive Data Constraints with Applications to Reasoning under Uncertainty
Constraints on different manifestations of data are a central concept in numerous areas of computer science. Examples include mathematical logic, database systems (functional and multivalued dependencies), data mining (association rules), and reasoning under uncertainty (conditional independence statements). One is often interested in a process that derives all or most of the constraints that a...
متن کاملImplications, coimplications and left semi-uninorms on a complete lattice
In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...
متن کاملAn Extended Framework for Default Reasoning
In this paper, we investigate the proof theory of default reasoning. We generalize Reiter's framework to a monotonic reasoning system, and in particular allow formulae with nested defaults. We give proof rules for this extended default logic, called default ionic logic, and give deduction theorems. We also give examples of applications of our framework to some well-known problems: weak implicat...
متن کاملProbability Distinguishes Different Types of Conditional Statements
Conditional statements, including subjunctive and counterfactual conditionals, are the source of many enduring challenges in formal reasoning. The language of probability can distinguish among several different kinds of conditionals, thereby strengthening our methods of analysis. Here we shall use probability to define four principal types of conditional statements: SUBJUNCTIVE, MATERIAL, EXIST...
متن کاملSimple Schemas for Unordered XML
We consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: disjunctive multiplicity schemas (DMS), and its restriction, disjunction-free multiplicity schemas (MS). We investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership of...
متن کامل